package org.ziegler.algorithm.dijkstra;

import java.util.HashMap;
import java.util.Map;

public class Search {

    private Map<String, Map<String, Edge>> edges = new HashMap<>();


    public static void main(String[] args) {
        Search search = new Search();
        search.init();
        search.start();
    }

    private void start() {

    }

    void init() {
        addEdge("s", "a", 6);


    }

    public void addEdge(String from, String to, int cost) {
        Edge edge = new Edge(from, to, 6);
        Map<String, Edge> s = edges.getOrDefault(edge.getFrom(), new HashMap<>());
        s.put(edge.getTo(), edge);
    }


}
